Comparing Refinements for Failure and Bisimulation Semantics
نویسندگان
چکیده
Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled transition systems, whereas in failure semantics refinement is based on inclusions between failure systems. There exist however pairs of refinements, for bisimulation and failure semantics respectively, that have almost the same properties. Furthermore, each refinement in bisimulation semantics implies its counterpart in failure semantics, and conversely each refinement in failure semantics implies its counterpart in bisimulation semantics defined on the canonical form of the compared processes.
منابع مشابه
Comparing Two Information Flow Security Properties
In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we define the Failure Non-deducibility on Compositions, a failure semantics version of the BNDC. The common specification language used for the comparison is the Security Process Algebra [4], an extension of CCS [8] whic...
متن کاملEquivalence notions and refinement for timed Petri nets ?
The paper is contributed to develop a family of equivalence notions for real-time systems represented by labelled Merlin’s time Petri nets with zero length time intervals (i.e., with fixed time delays). We call them “timed Petri nets”. In particular, we introduce timed (time-sensitive), untimed (time-abstracting) and region (based on the notion of region [1]) equivalences in both the trace and ...
متن کامل-angelic Choice for Process Algebra
The-angelic choice is an operator that captures the behaviour of the external choice of CSP in a branching time setting. The idea of the-angelic choice is to delay any choice until an observable action happens. In this way, this new operator avoids preemption introduced by internal actions (actions). It is studied in theories with abstraction, more precisely, branching bisimulation and-bisimula...
متن کاملComparing three semantics for Linda-like languages
A simple calculus based on generative communication is introduced; among its prim-itives, it contains a conditional input operation that tests for presence (or absence) of an output, reminiscent of the inp predicate of Linda. We study three diierent semantics for the output operation, called instantaneous, ordered and unordered, and we compare these approaches from two diierent points of view. ...
متن کاملτ-Equivalences for analysis of concurrent systems modelled by Petri nets with silent transitions
The paper is devoted to the investigation of behavioural equivalences for Petri nets with silent transitions (τ -equivalences). Basic τ -equivalences and back-forth τ -bisimulation equivalences are supplemented by new ones, giving rise to the complete set of equivalence notions in interleaving / true concurrency and linear / branching time semantics. Their interrelations are examined for the ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 52 شماره
صفحات -
تاریخ انتشار 2002